Speeding up the 'Puzzle' Benchmark a 'Bit'
نویسنده
چکیده
Baskett's "Puzzle" benchmark has been used for almost a decade for the evaluation of hardware architectures, and was included in the "Gabriel" suite of Lisp benchmarks [Gabriel85]. "Puzzle" solves a 3-dimensional packing problem by attempting to pack pieces of 4 different types into a 5x5x5 cube. The class of such packing problems is closely related to the "bin-packing" and "knapsack" problems of complexity theory, which are known to be NP-complete [Baase78]. Thus, while it is unlikely that clever programming will allow us to escape the asymptotic exponential behavior of these problems, it can gain us some very real performance improvements.
منابع مشابه
Introducing an Invention: Puzzle Shaped Cast for Upper Limb Fractures
Upper limb fractures are prevalent injuries. An essential element of fracture healing is to maintain the bones alignment. However there are lots of complications associated with traditional ways of treatment, such as compartment syndrome and stiffness due to immobility for long time. Also evaluation and observation of the limb under the casts for potential infections and skin issues are n...
متن کاملSpeeding up the Stress Analysis of Hollow Circular FGM Cylinders by Parallel Finite Element Method
In this article, a parallel computer program is implemented, based on Finite Element Method, to speed up the analysis of hollow circular cylinders, made from Functionally Graded Materials (FGMs). FGMs are inhomogeneous materials, which their composition gradually varies over volume. In parallel processing, an algorithm is first divided to independent tasks, which may use individual or shared da...
متن کاملEfficient Modular Exponentiation-Based Puzzles for Denial-of-Service Protection
Client puzzles are moderately-hard cryptographic problems — neither easy nor impossible to solve — that can be used as a countermeasure against denial of service attacks on network protocols. Puzzles based on modular exponentiation are attractive as they provide important properties such as non-parallelisability, deterministic solving time, and linear granularity. We propose an efficient client...
متن کاملCascaded Execution: Speeding Up Unparallelized Execution on Shared-Memory Multiprocessors
Both inherently sequential code and limitations of analysis techniques prevent full parallelization of many applications by parallelizing compilers. Amdahl’s Law tells us that as parallelization becomes increasingly effective, any unparallelized loop becomes an increasingly dominant performance bottleneck. We present a technique for speeding up the execution of unparallelized loops by cascading...
متن کاملDeclarative and Procedural Strategies in Problem Solving: Evidence from the Toads and Frogs Puzzle
The relationship between theoretically-grounded hints, strategy selection, and solution performance in the Toads and Frogs puzzle, a well-structured problem in which weak methods are difficult to apply, is investigated through an experiment and an ACT-R simulation. The main results show that providing a state specific hint is useful in speeding up the adoption of a hybrid solution strategy, com...
متن کامل